Effectual topological complexity

نویسندگان

چکیده

We introduce the effectual topological complexity (ETC) of a [Formula: see text]-space text]. This is text]-equivariant homotopy invariant sitting in between effective pair text] and (regular) orbit space study ETC for spheres surfaces with antipodal involution, obtaining full computation case torus. allows us to prove vanishing twice nontrivial obstruction responsible fact that Klein bottle In addition, this gives counterexample possibility — suggested Pavešić’s work on map would agree Farber’s whenever projection finitely sheeted. conjecture action recasts Hopf one problem, describe (conjecturally optimal) motion planners.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Topological Complexity in Protein Structures

Abstract: For DNAmolecules, topological complexity occurs exclusively as the result of knotting or linking of the polynucleotide backbone. By contrast, while a few knots and links have been found within the polypeptide backbones of some protein structures, non-planarity can also result from the connectivity between a polypeptide chain and interand intra-chain linking via cofactors and disulfide...

متن کامل

Topological Complexity of Motion Planning

In this paper we study a notion of topological complexity TC(X) for the motion planning problem. TC(X) is a number which measures discontinuity of the process of motion planning in the configuration space X. More precisely, TC(X) is the minimal number k such that there are k different “motion planning rules”, each defined on an open subset of X×X, so that each rule is continuous in the source a...

متن کامل

Topological Complexity of Graphic Arrangements

By combining Yuzvinsky’s criteria from [13] with tools from graph theory, we obtain an explicit combinatorial condition on a finite graph G which guarantees that the higher topological complexity TCs of the complement of the associated graphic arrangement AG is equal to the dimensional upper bound sr − 1, where r is the rank of AG.

متن کامل

Topological Complexity of Blowup Problems

Consider the initial value problem of the first-order ordinary differential

متن کامل

Toward a Topological Characterization of Asynchronous Complexity

This paper introduces the use of topological models and methods, formerly used to analyze computability, as tools for the quantification and classification of asynchronous complexity. We present the first asynchronous complexity theorem, applied to decision tasks in the iterated immediate snapshot (IIS) model of Borowsky and Gafni. We do so by introducing a novel form of topological tool called...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Topology and Analysis

سال: 2021

ISSN: ['1793-7167', '1793-5253']

DOI: https://doi.org/10.1142/s1793525321500618